On matrix factorizations for recursive pruned discrete cosine transforms
نویسندگان
چکیده
This paper presents two matrix factorizations for recursive pruned discrete cosine transforms. Both factorizations have lower computational complexity when compared to the method of El-Sharkawy and Eshmawy (1995). ( 1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
Automatic generation of fast discrete signal transforms
This paper presents an algorithm that derives fast versions for a broad class of discrete signal transforms symbolically. The class includes but is not limited to the discrete Fourier and the discrete trigonometric transforms. This is achieved by finding fast sparse matrix factorizations for the matrix representations of these transforms. Unlike previous methods, the algorithm is entirely autom...
متن کاملFast Factorizations of Discrete Sine Transforms of Types Vi and Vii
Discrete Sine Transforms of types VI and VII (DST-VI/VII) have recently received considerable interest in video coding. In particular, it was shown that DST-VII offers good approximation for KLT of residual signals produced by spatial (Intra) prediction process. In this paper, we offer an additional argument for use of such transforms by showing that they allow fast computation. Specifically, w...
متن کاملAutomating the modeling and optimization of the performance of signal transforms
Fast implementations of discrete signal transforms, such as the discrete Fourier transform (DFT), the Walsh–Hadamard transform (WHT), and the discrete trigonometric transforms (DTTs), can be viewed as factorizations of their corresponding transformation matrices. A given signal transform can have many different factorizations, with each factorization represented by a unique but mathematically e...
متن کاملCooley-Tukey FFT like algorithms for the DCT
The Cooley-Tukey FFT algorithm decomposes a discrete Fourier transform (DFT) of size n = km into smaller DFTs of size k and m. In this paper we present a theorem that decomposes a polynomial transform into smaller polynomial transforms, and show that the FFT is obtained as a special case. Then we use this theorem to derive a new class of recursive algorithms for the discrete cosine transforms (...
متن کاملA Comrade-Matrix-Based Derivation of the Eight Versions of Fast Cosine and Sine Transforms
The paper provides a full self-contained derivation of fast algorithms to compute discrete Cosine and Sine transforms I IV. For the Sine I/II and Cosine I/II transforms a unified derivation based on the concept of the comrade matrix is presented. The comrade matrices associated with different versions of the transforms differ in only a few boundary elements; hence, in each case algorithms can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing
دوره 68 شماره
صفحات -
تاریخ انتشار 1998